<h3>Description</h3>
<p><p>There is a match in bjtu's acm team. We have n ( 0 &lt; n &lt;= 100 ) members to take part in this match. All the people have a different speed s ( 0 &lt; s &lt;= 500 ). To make the result more immesurable, the runner will have different start-line. However they will have the equal end-line.<br />Louty is very fat, so Mr. Li want to know how many people finish the race after Louty.<br />You can assume no one finishing the race with Louty at the same time.</p></p>
<h3>Input</h3>
<p><p>First line contains a number t, indicate the number of test case.<br />For each test case:<br />Line 1: a number n indicate the members of the race.<br />Line 2: a positive number indicate the endline.<br />Line 3: Louty's speed and his starting-line.<br />Follow n-1 lines: each member's speed and starting-line.</p></p>
<h3>Output</h3>
<p><p>For each test case output a single number that how many people finish after Louty.</p></p>
<h3>Sample Input</h3>
<p><p>2<br />5<br />100<br />15 0<br />20 2<br />30 5<br />40 10<br />50 60<br />5<br />100<br />20 0<br />6 0<br />7 0<br />8 0<br />3&#160;80</p></p>
<h3>Sample Output</h3>
<p><p><br />0<br />4</p></p>
<h3>Source</h3>
<p>Lu, Hao</p>
